基于K-AP算法的高光谱图像波段选择方法

在高光谱图像分析领域中，波段选择是一种能有效减少高光谱图像维度的方法。K类仿射传播算法是一种高效的聚类算法，已成功地应用于人脸识别和数据分析等领域，但在高光谱图像分析领域还少有成功的应用。提出将K-AP算法应用于高光谱图像波段选择，对高光谱图像进行有效的数据压缩。针对K-AP算法的特点，基于Kullback-Leibler散度定义了新的相似度矩阵，对波段进行度量，再使用K-AP算法进行聚类，选择最有代表性的波段。实验结果表明，与常用的波段选择方法相比，所提出的方法有更好的表现。     

基于多边限定的室内定位方法设计与系统实现

随着基于位置服务（Location Based Services，LBS）的发展与智能移动设备的普及，室内定位算法与系统受到了广泛研究与关注。为提高室内定位精度、增强系统鲁棒性，提出了基于多边限定的fingerprint定位方法。基于Wi-Fi RSSI（Received Signal Strength Indication）信号处理建立离线fingerprint数据库；通过对拟合距离-RSSI函数分析，提出了多边限定的方法确定一个最佳参考点（Reference Point，RP）集合，缩小在线定位阶段的搜索范围。在此基础上，再利用fingerprint定位方法进行定位。此外，实现了基于提出方法的室内定位系统原型用于算法性能评估。通过大量真实场景实验分析、验证了相较于传统fingerprint方法，基于多边限定的fingerprint定位方法能有效提高室内定位精度，增强系统鲁棒性。     

基于多基表示的滑动窗口椭圆曲线多标量乘算法

标量乘运算从整体上决定了椭圆曲线密码体制的快速实现效率，在一些椭圆曲线公钥密码体制中需要计算多标量乘。多基数链的标量表示长度更短、非零比特数目更少，较好地适用于椭圆曲线标量乘的快速计算。为了提高椭圆曲线密码的效率，在已有的二进制域和素域的标量乘算法的基础上，结合滑动窗口技术、多基算法，提出新的更高效的多标量乘算法。实验结果表明，新算法与传统Shamir算法和交错NAF算法相比，其所需的运算量更少，能有效地提高椭圆曲线多标量乘算法的效率，使多标量乘的运算更高效。相比于其他算法，新算法的计算效率比已有的多标量乘算法提高了约7.9%~20.6%。     

高速旋转机械用消除频率混叠现象的小波变换算法研究

高速旋转机械由于其工作转速高、控制精度高，其故障信号又属于微弱突变信号，造成常规监测方法准确率偏低，成为制约高速旋转机械故障监测进一步发展的最大障碍。本文设计了一种消除小波分解和重构过程中产生的频率混叠的算法。该算法利用傅里叶变换和傅里叶逆变换构成Mallat小波变换在分解和重构过程中所需的严格正交镜像滤波器，从而达到Mallat小波变换过程中必须具有的理想截止特性，最终去除掉多余的频率成分。利用改进前后的小波算法对实际信号进行分析，结果表明，本文设计的Mallat小波变换改进算法可消除信号分析中出现的频率混叠现象。     

An adjusted K‐medoids clustering algorithm for effective stability in vehicular ad hoc networks

Recently, the routing problem in vehicular ad hoc networks is one of the most vital research. Despite the variety of the proposed approaches and the development of communications technologies, the routing problem in VANET suffers from the high speed of vehicles and the repetitive failures in communications. In this paper, we adjusted the well‐known K‐medoids clustering algorithm to improve the network stability and to increase the lifetime of all established links. First, the number of clusters and the initial cluster heads will not be selected randomly as usual, but based on mathematical formula considering the environment size and the available transmission ranges. Then the assignment of nodes to clusters in both k‐medoids phases will be carried out according to several metrics including direction, relative speed, and proximity. To the best of our knowledge, our proposed model is the first that introduces the new metric named “node disconnection frequency.” This metric prevents nodes with volatile and suspicious behavior to be elected as a new CH. This screening ensures that the new CH retains its property as long as possible and thus increases the network stability. Empirical results confirm that in addition to the convergence speed that characterizes our adjusted K‐medoids clustering algorithm (AKCA), the proposed model achieves more stability and robustness when compared with most recent approaches designed for the same objective.     

基于孪生支持向量回归机的转炉炼钢终点预测

为了提高转炉炼钢的终点命中率，建立了一种新的转炉终点预测模型，实现了对转炉终点碳质量分数和温度的准确预测。模型采用K最近邻孪生支持向量机(KNNWTSVR)算法，将权重矩阵引入到目标函数中，并利用鲸群优化算法进行求解，提高了传统算法的性能；然后基于某炼钢厂260 t转炉的实际生产数据，建立了转炉炼钢终点预测模型。结果表明，预测模型的终点碳质量分数(误差±0.005%)和温度(误差±15 ℃)的终点单命中率分别为94%和88%，双命中率达到84%。与其他两种现有的建模方法相比，本模型取得了最优的预测效果。该方法满足转炉炼钢实际生产的需求，也可适用于钢铁冶金其他领域的数学建模。     

A robust locating multi-optima approach for damage identification of plate-like structures

This paper proposes a robust optimization approach for multiple damage identification of plate-like structures. Different from traditional particle swarm optimizations (PSOs), a combined PSO and niche technique (NPSO) is proposed to solve multimodal optimization problems, with the full consideration of subswarm creation, merging and absorbing mechanism. As a hypersensitive parameter to damage, the curvature mode shape is adopted to construct the objective function. Case studies are conducted to investigate the effectiveness and robustness of the algorithm on multi-damage identification. Simulation results show that the proposed algorithm exhibits robust search performance on identifying damage locations accurately with good convergence behavior. It is hoped that this study can provide guidance on robust damage detection, especially when the structure is subject to multiple damages and external disturbances.     

考虑区域协调性的城际列车开行方案优化

针对城际列车开行方案没有有效匹配城市轨道交通运能的问题，提出一种考虑区域协调性的城际列车开行方案优化方法。首先，以旅客出行费用最小和铁路运输效益最大为优化目标，考虑城际列车载客能力、出发地目的地（Original Destination，OD）客流需求和通过能力等约束；然后，在此基础上增加运能匹配度的限制，构建了考虑区域协调性的城际列车开行方案多目标非线性规划模型，并设计改进的模拟退火算法求解模型；最后，以广深城际铁路为例并进行两组对比分析。实验结果表明:考虑区域协调性的列车开行方案可以使旅客出行总广义费用降低约4.06%，铁路部门的效益提高约9.58%，旅客和铁路的系统总成本降低约23.27%；与遗传算法相比，改进的模拟退火算法在求解质量与收敛速度上均有较大提高。所提模型和算法可充分兼顾旅客和铁路双方利益，能够为城际列车开行方案优化问题提供有效解决方法。     

Quasi gradient-based inversion-free iterative algorithm for solving a class of the nonlinear matrix equations

Inspired by the gradient-based and inversion-free iterations, a new quasi gradient-based inversion-free iterative algorithm is proposed for solving the nonlinear matrix equation $X+A^{\mathrm{T}}{X}^{?n}A=I$. The convergence proof of the suggested algorithm is given. Several matrix norm inequalities are established to depict the convergence properties of this algorithm. Three numerical examples are given to illustrate the effectiveness of the suggested algorithms.     

最优化算法与纯元素谱剥离相结合的能量色散X射线荧光谱解谱方法

在进行能量色散X射线荧光光谱(EDXRF)解谱时,如果给定样品的元素构成,采用纯元素谱图剥离的方式会更加合理,但由于每个元素的谱线都不止一条,如果仅仅针对主线对齐做剥离,会导致结果的严重失真,同时剥离次序对解谱结果有较大影响。介绍了一种最优化算法与纯元素谱剥离相结合的EDXRF解谱方法,该方法以多个纯元素谱的强度大小和峰位漂移道数作为变量构建残差方程,并用最优化计算的方法去调整,直至残差达到极小。实验采用强度顺序剥离、能量顺序剥离和最优化算法拟合3种方法分别对谱线重叠较为严重的La-Ce-Pr-Nd混合液样品的L系谱线进行了解析,结果表明最优化计算方法拟合的谱图与原始谱的残差 (1415.0)比另两种方法(166094.0和3192.7)大幅度缩小,拟合谱与原始谱更为吻合,并且方法在实现时对初值不敏感,解谱精度也不依赖于剥离次序。